Improved hybrid algorithm for finding roots of error-locator polynomials

In this paper we suggest a hybrid method for finding toots of error locator polynomials. We first review a fast version of the Chien search algorithm based on the decomposition of the error locator polynomial into a sum of multiples of affine polynomials. We then propose to combine it with modified analytical methods for solution of polynomials of small degree in radicals. We suggest, in particular, two efficient decompositions, whose combination with analytical algorithms yields a significant reduction in time-complexity, as proved by means of simulation.